Functionally-Generalised MOQA Operations
نویسندگان
چکیده
منابع مشابه
MOQA - Meaning-Oriented Question-Answering
The paper describes a system which uses a fact repository (FR) consisting of instances of ontological concepts to answer sequences of questions. The fact repository is populated automatically by analyzing texts to produce complex text meaning structures. These are then mapped to fact repository instances and stored in a relational database. The documents used by the system are news articles in ...
متن کاملGeneralised Composition Operations for High-level Petri Nets
We propose generic schemes for basic composition operations (sequential composition , choice, iteration, and reenement) for high-level Petri nets. They tolerate liberal combinations of place types (equal, disjoint, intersecting) and, owing to a parameterised scheme of type construction, allow for weak and strong versions of compositions. Properties such as associativity, commutativity, and cohe...
متن کاملGeneralised Test = Generalised Inference
Tim Menzies Dept. of Software Development, Monash University, Australia [email protected]; http://www.sd.monash.edu.au/ timm Abstract|We are used to viewing veri cation and validation as tasks to be performed after a knowledge-base is built. In this standard view, the inference engine is built rst, the knowledge base is then lled out, then nally a test engine is added to verify or va...
متن کاملDCU-ADAPT: Learning Edit Operations for Microblog Normalisation with the Generalised Perceptron
We describe the work carried out by the DCU-ADAPT team on the Lexical Normalisation shared task at W-NUT 2015. We train a generalised perceptron to annotate noisy text with edit operations that normalise the text when executed. Features are character n-grams, recurrent neural network language model hidden layer activations, character class and eligibility for editing according to the task rules...
متن کاملThe Scale Method for Blending Operations in Functionally-Based Constructive Geometry
This paper presents a scale method for developing high dimensional scale functions to blend implicitly defined objects. Scale functions are differentiable on the entire domain except the origin, provide blending range control, and behave like Min/Max operators everywhere, so even a successive composition of blending operations containing overlapped blending regions can be generated smoothly. Be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.090